An Improved PSO Algorithm Coupling with Prior Information for Function Approximation
نویسندگان
چکیده
منابع مشابه
An Improved PSO Clustering Algorithm with Entropy-based Fuzzy Clustering
Particle swarm optimization is a based-population heuristic global optimization technology and is referred to as a swarm-intelligence technique. In general, each particle is initialized randomly which increases the iteration time and makes the result unstable. In this paper an improved clustering algorithm combined with entropy-based fuzzy clustering (EFC) is presented. Firstly EFC algorithm ge...
متن کاملAn Improved PSO Algorithm with Decline Disturbance Index
The particle swarm optimization algorithm (PSO) has two typical problems as in other adaptive evolutionary algorithms, which are based on swarm intelligence search. To deal with the problems of the slow convergence rate and the tendency to trap into premature, an improved particle swarm optimization with decline disturbance index (DDPSO) is presented in this paper. The index was added when the ...
متن کاملFinding high-influence microblog users with an improved PSO algorithm
Particle swarm optimisation (PSO) is a stochastic optimisation algorithm based on swarm intelligence. The algorithm applies the concept of social interaction to find optimal solution. Sina Weibo is one of the most popular Chinese microblog platforms. Microblog users participate in network interaction by publishing tweets and retweets. The influences of microblog users are determined by the user...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملAn improved approximation algorithm for requirement cut
This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G = (V , E), and g groups of vertices X1, . . . , Xg ⊆ V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find aminimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tightΘ(log g) ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2011
ISSN: 1812-5638
DOI: 10.3923/itj.2011.2226.2231